Application of Artificial Intelligence Computer Intelligent Heuristic Search Algorithm

In order to transform three-dimensional space path planning into two-dimensional plane problem and greatly reduce the search time, an intelligent heuristic algorithm based on artificial intelligence is proposed. The analyzed introduced, A chosen. spatial environment model of picking robot investigated, a established by raster method. Then, considering whole day operation time divided several periods. With help algorithm, most reasonable interval each period found, so as provide reliable reference for decision-making organization urban rail transit how arrange train rationally. experimental results show that improved ∗ can significantly improve moving make planned smoother, which confirms feasibility superiority algorithm. decision obtained through experiments. After 114 iterations optimal value 6.83353635 id="M2"> e -001, while average 6.83551939 id="M3"> -001. 231 particle swarm optimization 6.83650785 id="M4"> 6.83745935 id="M5"> 789 iterations, genetic obtains 6.83921100 id="M6"> 6.84410765 id="M7"> Through comparative analysis, it be seen compared with other two algorithms, better than both in terms number iterations. fast, accurate, method solve accurate scheduling departure interval. It proved computer realize effectively.